p-RIP CONDITION FOR SIGNAL RECOVERY VIA lp MINIMIZATION
نویسندگان
چکیده
منابع مشابه
The high order block RIP condition for signal recovery
In this paper, we consider the recovery of block sparse signals, whose nonzero entries appear in blocks (or clusters) rather than spread arbitrarily throughout the signal, from incomplete linear measurement. A high order sufficient condition based on block RIP is obtained to guarantee the stable recovery of all block sparse signals in the presence of noise, and robust recovery when signals are ...
متن کاملExact Recovery for Sparse Signal via Weighted l_1 Minimization
Numerical experiments in literature on compressed sensing have indicated that the reweighted l1 minimization performs exceptionally well in recovering sparse signal. In this paper, we develop exact recovery conditions and algorithm for sparse signal via weighted l1 minimization from the insight of the classical NSP (null space property) and RIC (restricted isometry constant) bound. We first int...
متن کاملSparse Signal Recovery via Generalized Entropy Functions Minimization
Compressive sensing relies on the sparse prior imposed on the signal to solve the ill-posed recovery problem in an under-determined linear system. The objective function that enforces the sparse prior information should be both effective and easily optimizable. Motivated by the entropy concept from information theory, in this paper we propose the generalized Shannon entropy function and Rényi e...
متن کاملSparse Recovery with Fusion Frames via RIP
We extend ideas from compressive sensing to a structured sparsity model related to fusion frames. We present theoretical results concerning the recovery of sparse signals in a fusion frame from undersampled measurements. We provide both nonuniform and uniform recovery guarantees. The novelty of our work is to exploit an incoherence property of the fusion frame which allows us to reduce the numb...
متن کاملLow-Rank Matrix Recovery via Efficient Schatten p-Norm Minimization
As an emerging machine learning and information retrieval technique, the matrix completion has been successfully applied to solve many scientific applications, such as collaborative prediction in information retrieval, video completion in computer vision, etc. The matrix completion is to recover a low-rank matrix with a fraction of its entries arbitrarily corrupted. Instead of solving the popul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Sciences: Advances and Applications
سال: 2017
ISSN: 0974-5750
DOI: 10.18642/jmsaa_7100121782